The generator matrix

X 1 1 1 1 X X X^2 1 1 1 X^2+X X 1 0 X 1 1 X^2 1 0 1 1 1 1 1 1 X^2 0 1 X^2 1 0 X^2+X 1 X X^2 0 1 X^2+X 0 1 1 1 1 1 1 X^2 X^2+X 1
1 0 1 1 0 1 X^2 1 X^2+X+1 X X^2+X 1 X^2+X X+1 1 1 X+1 0 X X^2+1 1 X^2+X+1 X X^2+X+1 X^2+X X+1 0 1 X^2+X X+1 1 X^2+X X^2 1 X^2+1 X X^2+X 1 1 1 X X^2+X+1 X^2+X X^2+1 X^2 X^2+1 0 X X^2+X X^2+1
X^2+1 0 1 X^2+X X^2+1 X 1 X^2 1 X^2+1 X^2 X^2+X+1 1 X X 0 X+1 X 1 X^2 X^2+X+1 X X+1 X^2 X X^2+X+1 X+1 1 1 0 X+1 X^2+X+1 1 X+1 X+1 1 1 1 X^2+X+1 1 X X+1 X^2+1 X^2+X+1 1 X X^2+X+1 X^2+X 1 0

generates a code of length 50 over Z2[X]/(X^3) who´s minimum homogenous weight is 48.

Homogenous weight enumerator: w(x)=1x^0+258x^48+96x^50+104x^52+48x^56+5x^64

The gray image is a linear code over GF(2) with n=200, k=9 and d=96.
As d=96 is an upper bound for linear (200,9,2)-codes, this code is optimal over Z2[X]/(X^3) for dimension 9.
This code was found by an older version of Heurico in 0 seconds.